707A - Brain's Photos - CodeForces Solution

implementation *800

Please click on ads to support us..

Python Code: 

s = [int(i) for i in list(input().split())]

n = s[0]
m = s[1]

count = 0
for i in range(n):
    w = list(input().split())
    for j in range(m):
        if w[j] == 'C' or w[j] == 'M' or w[j] == 'Y':
            count += 1

if count == 0:
    print('else:
    print('

C++ Code: 

#include<iostream>
#include<vector>
using namespace std;
int main()
{ 
     int n,m;
     cin>>n>>m;
     char a[n][m];
     for(int i=0;i<n;i++)
     {
         for(int j=0;j<m;j++)
          cin>>a[i][j];
     }
     bool flag =true;
     for(int i=0;i<n;i++)
     {
        for(int j=0;j<m;j++)
        {
             if(a[i][j]!='W' && a[i][j]!='B' &&a[i][j]!='G')
             {
                flag=false;
                break;
             }
             if(flag==false)
             break;
        }
     }
     if(flag==true)
      cout<<"#Black&White";
    else cout<<"#Color";
    return 0;
}


Comments

Submit
0 Comments
More Questions

1450A - Avoid Trygub
327A - Flipping Game
411A - Password Check
1520C - Not Adjacent Matrix
1538B - Friends and Candies
580A - Kefa and First Steps
1038B - Non-Coprime Partition
43A - Football
50A - Domino piling
479A - Expression
1480A - Yet Another String Game
1216C - White Sheet
1648A - Weird Sum
427A - Police Recruits
535A - Tavas and Nafas
581A - Vasya the Hipster
1537B - Bad Boy
1406B - Maximum Product
507B - Amr and Pins
379A - New Year Candles
1154A - Restoring Three Numbers
750A - New Year and Hurry
705A - Hulk
492B - Vanya and Lanterns
1374C - Move Brackets
1476A - K-divisible Sum
1333A - Little Artem
432D - Prefixes and Suffixes
486A - Calculating Function
1373B - 01 Game